Fe b 20 09 Sparse representation of solutions of Kronecker product systems ∗
نویسندگان
چکیده
Three properties of matrices: the spark, the mutual incoherence and the restricted isometry property have recently been introduced in the context of compressed sensing. We study these properties for matrices that are Kronecker products and show how these properties relate to those of the factors. For the mutual incoherence we also discuss results for sums of Kronecker products.
منابع مشابه
Non-Iterative Computation of Sparsifiable Solutions to Underdetermined Kronecker Product Linear Systems of Equations
The problem of computing sparse (mostly zero) or sparsifiable (by linear transformation) solutions to underdetermined linear systems of equations has applications in compressed sensing and minimumexposure medical imaging. We present a simple, noniterative, low-computational-cost algorithm for computing a sparse solution to an underdetermined linear system of equations. The system matrix is the ...
متن کاملSparse Solutions to Underdetermined Kronecker Product Systems ∗
Three properties of matrices: the spark, the mutual incoherence and the restricted isometry property have recently been introduced in the context of compressed sensing. We study these properties for matrices that are Kronecker products and show how these properties relate to those of the factors. For the mutual incoherence we also discuss results for sums of Kronecker products.
متن کاملHierarchical restricted isometry property for Kronecker product measurements
Hierarchically sparse signals and Kronecker product structured measurements arise naturally in a variety of applications. The simplest example of a hierarchical sparsity structure is two-level (s, σ)-hierarchical sparsity which features s-block-sparse signals with σ-sparse blocks. For a large class of algorithms recovery guarantees can be derived based on the restricted isometry property (RIP) ...
متن کاملOn Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree distribution) with efficiently calculable ground-truth solutions to the desired output. Reproducibility for current generators [1] used in benchmarking are somewhat la...
متن کاملFast Subspace Clustering Based on the Kronecker Product
Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is often smaller than the ambient dimension. Spectral clustering, as one of the main approaches to subspace clustering, often takes on a sparse representation or a low-rank representation to learn a block diagonal self-representation matrix for subspace gener...
متن کامل